Tree Shape and Branch Structure: Mathematical Models

نویسنده

  • Dick F. Yeatts
چکیده

This study of tree morphology is presented in three parts: Part 1 deals with the profile (or envelope) of trees and woody plants. Noting that most trees exhibit: (i) azimuthal symmetry about the central axis (often the main stem or bole) in both in foliage and scaffolding; and (ii) decrease in leaf density from branch-end toward the central axis, a mathematical model is developed using the calculus of variations that predicts the profile, with but one free parameter. The analysis predicts profiles range from the nearly spherical in the case of uniform distribution of leaves throughout the crown, to essentially conical when the leaves are found largely on the branch-ends. The results are presented in figures showing theoretical profiles overlaid on photographs of representative trees. Part 2 is based on field measurements that show that the cross-sectional area of a branch (or stem) entering a fork (in the direction of water transport) is less than the sum of the cross-sectional areas of the branches leaving that fork. Mathematical analysis using the calculus of variations shows that this “bulking up” actually reduces the quantity of plant tissue incorporated in the branching. Furthermore, it is shown that the angle of branching increases with bulking up. Field measurements are in rough agreement with this prediction. Part 3 brings together the concepts of the first two parts to predict the cross-sectional area of the bole as a function of longitudinal position. Using equations appropriate to a tree with a single main stem and horizontal side branches, the cross-sectional area of the bole is calculated. The results compare favorably with field measurements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Artificial Neural Network, Decision Tree and Bayesian Network Models in Regional Flood Frequency Analysis using L-moments and Maximum Likelihood Methods in Karkheh and Karun Watersheds

Proper flood discharge forecasting is significant for the design of hydraulic structures, reducing the risk of failure, and minimizing downstream environmental damage. The objective of this study was to investigate the application of machine learning methods in Regional Flood Frequency Analysis (RFFA). To achieve this goal, 18 physiographic, climatic, lithological, and land use parameters were ...

متن کامل

Critical Review , 21 April

This is a critical review of the paper “An Airway Tree-shape Model for Geodesic Airway Branch Labeling” written by Feragen et. al. [1]. This paper presents a method for airway branch labeling by computing geodesic deformations between mathematical airway tree-shape models. The authors claim that the labeling results are good taking the large variation in the training set into account. Even thou...

متن کامل

Detection and Modelling of 3d Trees from Mobile Laser Scanning Data

Mobile laser scanning acquires massive point clouds in urban areas to provide high resolution data for 3D city modelling. A workflow for detecting and modelling trees from point clouds is presented. Emphasis lies on data reduction using an alpha shape approach. From the reduced point cloud the parameters are extracted to model the 3D trees using the Weber and Penn (1995) approach. The workflow ...

متن کامل

An Airway Tree-shape Model for Geodesic Airway Branch Labeling

We present a mathematical airway tree-shape framework where airway trees are compared using geodesic distances. The framework consists of a rigorously defined shape space for treelike shapes, endowed with a metric such that the shape space is a geodesic metric space. This means that the distance between two tree-shapes can be realized as the length of the geodesic, or shortest deformation, conn...

متن کامل

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

The Steiner tree problem with revenues, budget and hop constraints is a variant of the Steiner tree problem where, besides the costs associated with arcs, there are also revenues associated with the vertices. Budget and hop constraints impose limits on the total cost of the network and on the number of edges between any vertex and the root, respectively. This article introduces and compares sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • MCFNS

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012